A Logic-based Formalism for Reasoning about Visual Representations (Extended Abstract)
نویسنده
چکیده
This paper presents a logic-based formalism for formal reasoning about visual representations. This formalism is based on previous work about describing visual notations (Haarslev 1998). However, in this paper we discuss major extensions to this formalism providing decidable reasoning mechanisms that support truly spatial domains such as geographical information systems (GIS). We sketch out the application of this formalism to the specification of syntax and semantics of visual query languages for GIS and to meta reasoning about spatial queries. Our logic formalism integrates research from the AI community ·-especially description logic and constraint solvingand from the qualitative spatial reasoning community. It can be considered 3.':i a decidable formalism for spatial knowledge representation. We think that our formalism is well suited to handle truly visual representations, i.e. representations that exploit geometric or depictional constraints permitted by the plane. The above-mentioned domain of visual spatial query languages for GIS is a suitable candidate for exhibiting truly visual representations. Our formalism is based on a recently developed description logic (DL) offering mechanisms for integrating so-called concrete domains (Ivloller, Haarslev, & Lutz 1997; Lutz, Haarslev, & Moller 1997; Haarslev, Lutz, & Moller 1998b) . We already explored suitable candidates for concrete domains that are based on theories about qualitative spatial reasoning (e.g. Egenhofer's work (Egenhofer 1991) or RCC8 (Randell, Cui , & Cohn 1992)) or about time (e.g. Allen 's interval logic (Allen 1983)) . These findings are also relevant for visual languages (VL) theory since they can provide a basis for specifying visual procedural semantics (time) or for specifying qualitative and quantitative (e.g. geometric) relationships about space. However, in this paper we only focus on spatial reasoning about visual representations. In our earlier work (Haarslev 1995; Haarslev & Wessel 1996; Haarslev 1998) spatial relations (e.g. touching, containing, etc.) are considered as un interpreted (primitive) binary relations with respect to DL theory. In order to correctly deal with spatial objects we needed an exter-
منابع مشابه
A Logic-based Formalism for Reasoning about Visual Representations
This article presents a logic-based formalism for formal reasoning about visual representations. This formalism is based on previous work about describing visual notations [Haarslev, 1998a]. However, in this article we discuss major extensions to this formalism providing decidable reasoning mechanisms that support truly spatial domains such as geographical information systems (GIS). We demonstr...
متن کاملPattern Graph Rewrite Systems
String diagrams are a powerful tool for reasoning about physical processes, logic circuits, tensor networks, and many other compositional structures. Dixon, Duncan and Kissinger introduced string graphs, which are a combinatoric representations of string diagrams, amenable to automated reasoning about diagrammatic theories via graph rewrite systems. In this extended abstract, we show how the po...
متن کاملFrom Visual to Logical Representation A GIS-Based Sketching Tool for Reasoning about Plans
Abstract: Multi-modal and heterogeneous logic reasoning is of increasing importance within the AI community. The GIS based ArcView COA Sketcher (ArCS) sketch and translation tool developed under DARPA’s High Performance Knowledge Bases program is an example of an enabling tool towards that goal. Army Course of Action (COA) sketches can be drawn and translated automatically into statements in a ...
متن کاملReasoning about Preferences in Structured Extended Argumentation Frameworks
This paper combines two recent extensions of Dung’s abstract argumentation frameworks in order to define an abstract formalism for reasoning about preferences in structured argumentation frameworks. First, extended argumentation frameworks extend Dung frameworks with attacks on attacks, thus providing an abstract dialectical semantics that accommodates argumentation-based reasoning about prefer...
متن کاملUniversit a Di Pisa towards a Fluent Logic Programming towards a Fluent Logic Programming
This work involves two areas of research in computer science, namely Knowledge Representation and Logic Programming. Starting from the formalism proposed in Features & Fluents by Erik Sandewall for describing and reasoning about Inhabited Dynamical Systems, we try to reconstruct it within a Logic Programming framework. The result is an extended logic programming language called Fluent Logic Pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011